solving flexible job-shop scheduling problem using hybrid algorithm based on gravitational search algorithm and particle swarm optimization

job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented for solving job shop scheduling problem with criteria ofminimizing the maximal completion time of all the operations, which is denoted bymakespan. in this combined algorithm, first gravitational search algorithm findsbest mass with minimum spent time for a job and then particle swarm optimizationalgorithm is performed for optimal processing all jobs.experimental results showthat proposed algorithm for solving job shop scheduling problem, especially forsolving larger problem presents better efficiency. combined proposed algorithm hasbeen named gspso.